home *** CD-ROM | disk | FTP | other *** search
- # Source Generated with Decompyle++
- # File: in.pyc (Python 2.4)
-
-
- def normalize(p):
- n = len(p)
- while n:
- if p[n - 1]:
- return p[:n]
-
- n = n - 1
- return []
-
-
- def plus(a, b):
- if len(a) < len(b):
- a = b
- b = a
-
- res = a[:]
- for i in range(len(b)):
- res[i] = res[i] + b[i]
-
- return normalize(res)
-
-
- def minus(a, b):
- neg_b = map((lambda x: -x), b[:])
- return plus(a, neg_b)
-
-
- def one(power, coeff):
- res = []
- for i in range(power):
- res.append(0)
-
- return res + [
- coeff]
-
-
- def times(a, b):
- res = []
- for i in range(len(a)):
- for j in range(len(b)):
- res = plus(res, one(i + j, a[i] * b[j]))
-
-
- return res
-
-
- def power(a, n):
- if n == 0:
- return [
- 1]
-
- if n == 1:
- return a
-
- if (n / 2) * 2 == n:
- b = power(a, n / 2)
- return times(b, b)
-
- return times(power(a, n - 1), a)
-
-
- def der(a):
- res = a[1:]
- for i in range(len(res)):
- res[i] = res[i] * (i + 1)
-
- return res
-
-